On certain aspects of generative grammar computer testing

The present paper deals with the description of computer testing of the functional generative description (proposed by P. Sgall). Illustrations are given of the system of programmes for testing the generative component of the grammar, and some aspects of notation necessitated by the specific requirements of computer testing are pointed out. 1. The problem whether a particular generative grammar is working in such a way as it is assumed to, is unsolvable by a linguist not aided by computer. Therefore, programmes started to be written, so as to enable the computer to test particular variants of generative description (cf. [1; 2; 3]). In the Computing Centre of Charles University in Prague tests are being worked out for functional generative description of the Czech language. Some preliminary tests were carried out earlier on smaler types of computers (LGP 30 — 1965; Minsk 22 — 1969). The aim of the present paper is to describe the preparation of the pro­ grammes for testing the generative component (GC) of a certain variant of functional generative description (cf. [4; 5]), enumerating semantic representations (SR's) of sentences. Before demonstrating the way in which the testing is carried out we shall give a brief outline of the basic properties of the GC of the functional generative de­ scription. The GC is a context-free phrase structure grammar, i.e. a grammar of the type 2 in Chomsky's classification of grammars. Together with the theory of immediate constituents the dependency syntax finds its application in it. In the GC there are